Effective grey‐box testing with partial FSM models

Compositional Testing For FSM-Based Models

The contribution of this paper is threefold: first, it defines a framework for modelling component-based systems, as well as a formalization of integration rules to combine their behaviour. This is based on finite state machines (FSM). Second, it studies compositional conformance testing i.e. checking whether an implementation made of conforming components combined with integration operators is...

FSM-based Re-Testing Methods

The selection of appropriate test cases is an important issue in software engineering. A number of methods are known for the selection of a test suite based on the specification and an implementation under test given in the form of a finite state machine (FSM). In realistic applications, this specification evolves incrementally throughout incorporating frequent modifications. In this paper, we ...

Delta-Oriented FSM-Based Testing

We use the concept of delta-oriented programming to organize FSM-based test models in an incremental structure. We then exploit incremental FSM-based testing to make efficient use of this high-level structure in generating test cases. We show how our approach can lead to more efficient test-case generation, both by analyzing the complexity of the test-case generation algorithm and by applying t...

Testing a probabilistic FSM using interval estimation

Testing deterministic implementations from nondeterministic FSM specifications

In this paper, conformance testing of protocols specified as nondeterministic finite state machines is considered. Protocol implementations are assumed to be deterministic. In this testing scenario, the conformance relation becomes a preorder, so-called reduction relation between FSMs. The reduction relation requires that an implementation machine produces a (sub)set of output sequences that ca...